On a Direct Algorithm for Computing Invariant Subspaces With. . .
نویسندگان
چکیده
[13] V. Mehrmann, A Symplectic orthogonal method for single input or single output discrete time optimal control problems, in Linear Algebra in Signals Systems and Control, B. N. Datta et al eds. SIAM Philadelphia, Penn. pp.128-140(1988). [14] K. C. Ng and B. N. Parlett, Development of an accurate algorithm for EXP(Bt), Part I, Programs to swap diagonal block, Part II, CPAM-294, University of California, Berkeley. 1988.
منابع مشابه
New Algorithm For Computing Secondary Invariants of Invariant Rings of Monomial Groups
In this paper, a new algorithm for computing secondary invariants of invariant rings of monomial groups is presented. The main idea is to compute simultaneously a truncated SAGBI-G basis and the standard invariants of the ideal generated by the set of primary invariants. The advantage of the presented algorithm lies in the fact that it is well-suited to complexity analysis and very easy to i...
متن کاملWeak*-closed invariant subspaces and ideals of semigroup algebras on foundation semigroups
Let S be a locally compact foundation semigroup with identity and be its semigroup algebra. Let X be a weak*-closed left translation invariant subspace of In this paper, we prove that X is invariantly complemented in if and only if the left ideal of has a bounded approximate identity. We also prove that a foundation semigroup with identity S is left amenab...
متن کاملDPML-Risk: An Efficient Algorithm for Image Registration
Targets and objects registration and tracking in a sequence of images play an important role in various areas. One of the methods in image registration is feature-based algorithm which is accomplished in two steps. The first step includes finding features of sensed and reference images. In this step, a scale space is used to reduce the sensitivity of detected features to the scale changes. Afterw...
متن کاملShift Invariant Spaces and Shift Preserving Operators on Locally Compact Abelian Groups
We investigate shift invariant subspaces of $L^2(G)$, where $G$ is a locally compact abelian group. We show that every shift invariant space can be decomposed as an orthogonal sum of spaces each of which is generated by a single function whose shifts form a Parseval frame. For a second countable locally compact abelian group $G$ we prove a useful Hilbert space isomorphism, introduce range funct...
متن کاملENTROPY OF GEODESIC FLOWS ON SUBSPACES OF HECKE SURFACE WITH ARITHMETIC CODE
There are dierent ways to code the geodesic flows on surfaces with negative curvature. Such code spaces give a useful tool to verify the dynamical properties of geodesic flows. Here we consider special subspaces of geodesic flows on Hecke surface whose arithmetic codings varies on a set with innite alphabet. Then we will compare the topological complexity of them by computing their topological ...
متن کاملContinuation of Invariant Subspaces in Large Bifurcation Problems
Recently, two of the authors and their collaborators have developed an algorithm for computing a smoothly varying basis for an invariant subspace of a parameter dependent matrix A : R → R. In this work, we extend the algorithm (i) to the case where n is large and direct methods are prohibitively expensive and (ii) to the case where eigenvalues collide, change order in the spectrum, or cross the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991